Appendix B — Assignment B

Instructions

You may talk to a friend, discuss the questions and potential directions for solving them. However, you need to write your own solutions and code separately, and not as a group activity.
Do not write your name on the assignment.
Insert Code cells in the template provided to write solutions for the assignment. Do not open a new notebook, and work from scratch.
Write your code in the Code cells of the Jupyter notebook. Ensure that the solution is written neatly enough to understand and grade.
Use Quarto to print the .ipynb file as HTML. You will need to open the command prompt, navigate to the directory containing the file, and use the command: quarto render filename.ipynb --to html. Submit the HTML file.
There are 5 points for clealiness and organization. The breakdow is as follows:

Must be an HTML file rendered using Quarto (1.5 pts).
There aren’t excessively long outputs of extraneous information (e.g. no printouts of unnecessary results without good reason, there aren’t long printouts of which iteration a loop is on, there aren’t long sections of commented-out code, etc.). There is no piece of unnecessary / redundant code, and no unnecessary / redundant text (1 pt)
The code follows the python style guide for naming variables, spaces, indentation, etc. (1 pt)
The code should be commented and clearly written with intuitive variable names. For example, use variable names such as number_input, factor, hours, instead of a,b,xyz, etc. (1.5 pts)

The assignment is worth 100 points, and is due on 27th Jan 2024 at 11:59 pm.

B.1 Sentence analysis

B.1.1 Word count

Write a function that accepts a word, and a sentence as arguments, and returns the number of times the word occurs in the sentence.

Call the function, and print the returned value if the word is “sea”, and the sentence is “She sells sea shells on the sea shore when the sea is calm.” Note that this is just an example to check your function. Your function should work for any word and sentence.

(10 points)

B.1.2 Max word count

Ask the user to input a sentence. Use the function in B.1.1 to find the word that occurs the maximum number of times in the sentence. Print the word and its number of occurences. If multiple words occur the maximum number of times, then you can print any one of them.

Check your program when the user inputs the sentence, “She sells sea shells on the sea shore when the sea is calm.”. Your program must print, “The word with the maximum number of occurences is ‘sea’ and it occurs 3 times.” Note that this is just an example to check your program. Your program must work for any sentence. If multiple words occur the most, you can print any of them.

(20 points)

B.2 Prime factors

B.2.1 Prime

Write a function that checks if an integer is prime. The function must accept the integer as an argument, and return True if the integer is prime, otherwise it must return False.

Call your function with the argument as 197.

(4 points)

B.2.2 Factor

Write a function that checks if an integer is a factor of another integer. The function must accept both the integers as arguments, and return True if the integer is a factor, otherwise it must return False.

Call your function with the arguments as (19,85).

(3 points)

B.2.3 Prime Factors

Prompt the user to input a positive integer. Use the functions in B.2.1 and B.2.2 to print the prime factors of the integer. Your program should be no more than 4 lines (excluding the comments)

Check your program is the user inputs 190

(8 points)

B.3 Binary search

B.3.1 Word search

The tuple named as tuple_of_words (find it in the template) consists of words. Write a function that accepts a word, say word_to_search and the tuple_of_words as arguments, and finds if the word_to_search occurs in the tuple_of_words or not. This is very simple to do with the code word_to_search in tuple_of_words. However, this code is unfortunately very slow.

As the words in the tuple_of_words are already sorted in alphabetical order, we can search using a faster way, called binary search. To implement binary search in a function, start by comparing word_to_search with the middle entry in the tuple_of_words. If they are equal, then you are done and the function should return True. On the other hand, if the word_to_search comes before the middle entry, then search the first half of tuple_of_words. If it comes after the middle entry, then search the second half of tuple_of_words. Then repeat the process on the appropriate half of the tuple_of_words and continue until the word is found or there is nothing left to search, in which case the function short return False. The < and > operators can be used to alphabetically compare two strings.

You may write just one function or multiple functions to solve this problem.

Check your function if the word_to_search is: 1. 'rocket' 2. 'rest' 3. 'ambush'

(25 points)

B.3.2 Iterations to find the word

Update the function in B.3.1 to also print the number of iterations it took to find the word_to_search or fail in finding the word_to_search.

Check your function if the word_to_search is: 1. 'rocket' 2. 'banner' 3. 'amendable'

(10 points)

B.3.3 Index of word

Update the function in B.3.2 to also print the index of word_to_search in tuple_of_words if the word is found in the tuple. For example, the index of ‘abacus’ is 0, the index of ‘abdomen’ is 1, and so on.

Check your function if the 'word_to_search' is: 1. 'rocket' 2. 'unburned' 3. 'ambush'

(10 points)

B.3.4 Maximum iterations

What is the maximum number of iterations it may take for your function to search or fail in searching the word_to_search. You may either write a program to answer this question, or answer it analytically.

(5 points)